Vector Ant Colony Optimization and Travelling Salesman Problem
نویسنده
چکیده
This paper introduces Vector Ant Colony Optimization (VACO), a distributed algorithm that is applied to solve the traveling salesman problem (TSP). In Any Colony System (ACS), a set of cooperating agents called ants cooperate to find good solutions of TSPs. Ants cooperate using an indirect form of communication mediated by pheromone they deposit on the edges of the TSP graph while building solutions. The proposed system (VACO) based on basic ACO algorithm with well distribution strategy in which the entire search area is initially divided into 2 n number of hyper-cubic quadrants where n is the dimension of search space for updating the heuristic parameter in ACO to improve the performance in solving TSP. From our experiments, the proposed algorithm has better performance than standard bench mark algorithms.
منابع مشابه
A CONSTRAINED SOLID TSP IN FUZZY ENVIRONMENT: TWO HEURISTIC APPROACHES
A solid travelling salesman problem (STSP) is a travelling salesman problem (TSP) where the salesman visits all the cities only once in his tour using dierent conveyances to travel from one city to another. Costs and environmental eect factors for travelling between the cities using dierent conveyances are dierent. Goal of the problem is to nd a complete tour with minimum cost that damages the ...
متن کاملParallel Implementation of Ant Colony Optimization for Travelling Salesman Problem
A parallel ant colony algorithm for the Travelling Salesman Problem (TSP) is presented. Some experiments using a MPI based framework are made and analyzed. The achieved results prove that the TSP parallel implementation is efficient. Key-Words: Travelling Salesman Problem, Ant Colony Optimization, Parallel Algorithms, Framework, Message Passing Interface.
متن کاملA modified elite ACO based avoiding premature convergence for travelling salesmen problem
The Travelling Salesmen Problem (TSP) is one of the most important and famous combinational optimization problems that aim to find the shortest tour. In this problem, the salesman starts to move from an arbitrary place called depot and after visiting all nodes, finally comes back to depot. Solving this problem seems hard because program statement is simple and leads this problem belonging to NP...
متن کاملAn Effect and Analysis of Parameter on Ant Colony Optimization for Solving Travelling Salesman Problem
Ant Colony optimization has proved suitable to solve a wide range of combinatorial optimization (or NP-hard) problems as the Travelling Salesman Problem (TSP). The first step of ACO algorithm is to set the parameters that drive the algorithm. The parameter has an important impact on the performance of the ant colony algorithm. The basic parameters that are used in ACO algorithms are; the relati...
متن کاملA Comparitive Study of Nearest Neighbour Algorithm and Genetic Algorithm in Solving Travelling Salesman Problem
---------------------------------------------------------------------***--------------------------------------------------------------------Abstract In this paper, we have used two algorithms, i.e. the Nearest Neighbor algorithm and Genetic Algorithm to solve the Travelling Salesman problem. The Travelling Salesman problem is a widely studied problem in computational mathematics. In the Travell...
متن کاملA combination of clustering algorithms with Ant Colony Optimization for large clustered Euclidean Travelling Salesman Problem
The algorithm of Ant Colony System (ACS) has been found attractive for solving combinatorial optimization problem such as Travelling Salesman Problem (TSP). The run-time for this algorithm increases with increase in number of nodes. In this paper, we propose an efficient method that reduces the run-time for very large-scale Euclidean TSP problem and yet conserve the quality of solution for cert...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014